TSTP Solution File: NLP265^18 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : NLP265^18 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 05:17:05 EDT 2022
% Result : Theorem 1.99s 2.20s
% Output : Proof 1.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP265^18 : TPTP v8.1.0. Released v8.1.0.
% 0.07/0.12 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 1 00:02:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.99/2.20 % SZS status Theorem
% 1.99/2.20 % Mode: mode506
% 1.99/2.20 % Inferences: 26605
% 1.99/2.20 % SZS output start Proof
% 1.99/2.20 thf(ty_mindex, type, mindex : $tType).
% 1.99/2.20 thf(ty_mworld, type, mworld : $tType).
% 1.99/2.20 thf(ty_'#b_bob', type, '#b_bob' : mindex).
% 1.99/2.20 thf(ty_bigcity, type, bigcity : ($i>mworld>$o)).
% 1.99/2.20 thf(ty_portland, type, portland : $i).
% 1.99/2.20 thf(ty_eigen__1, type, eigen__1 : mworld).
% 1.99/2.20 thf(ty_'#i_alice', type, '#i_alice' : mindex).
% 1.99/2.20 thf(ty_eigen__0, type, eigen__0 : mworld).
% 1.99/2.20 thf(ty_mrel, type, mrel : (mindex>mworld>mworld>$o)).
% 1.99/2.20 thf(ty_mactual, type, mactual : mworld).
% 1.99/2.20 thf(ty_'#b_alice', type, '#b_alice' : mindex).
% 1.99/2.20 thf(h0, assumption, (![X1:mworld>$o]:(![X2:mworld]:((X1 @ X2) => (X1 @ (eps__0 @ X1))))),introduced(assumption,[])).
% 1.99/2.20 thf(eigendef_eigen__1, definition, eigen__1 = (eps__0 @ (^[X1:mworld]:(~(((((mrel @ '#b_bob') @ eigen__0) @ X1) => ((bigcity @ portland) @ X1)))))), introduced(definition,[new_symbols(definition,[eigen__1])])).
% 1.99/2.20 thf(eigendef_eigen__0, definition, eigen__0 = (eps__0 @ (^[X1:mworld]:(~(((((mrel @ '#i_alice') @ mactual) @ X1) => (![X2:mworld]:((((mrel @ '#b_bob') @ X1) @ X2) => ((bigcity @ portland) @ X2)))))))), introduced(definition,[new_symbols(definition,[eigen__0])])).
% 1.99/2.20 thf(sP1,plain,sP1 <=> ((!!) @ ((mrel @ '#b_alice') @ mactual)),introduced(definition,[new_symbols(definition,[sP1])])).
% 1.99/2.20 thf(sP2,plain,sP2 <=> (((mrel @ '#b_alice') @ mactual) @ eigen__1),introduced(definition,[new_symbols(definition,[sP2])])).
% 1.99/2.20 thf(sP3,plain,sP3 <=> ((((mrel @ '#i_alice') @ mactual) @ eigen__0) => (![X1:mworld]:((((mrel @ '#b_bob') @ eigen__0) @ X1) => ((bigcity @ portland) @ X1)))),introduced(definition,[new_symbols(definition,[sP3])])).
% 1.99/2.20 thf(sP4,plain,sP4 <=> ((((mrel @ '#b_bob') @ eigen__0) @ eigen__1) => ((bigcity @ portland) @ eigen__1)),introduced(definition,[new_symbols(definition,[sP4])])).
% 1.99/2.20 thf(sP5,plain,sP5 <=> (sP2 => ((bigcity @ portland) @ eigen__1)),introduced(definition,[new_symbols(definition,[sP5])])).
% 1.99/2.20 thf(sP6,plain,sP6 <=> (![X1:mworld]:((((mrel @ '#i_alice') @ mactual) @ X1) => (![X2:mworld]:((((mrel @ '#b_bob') @ X1) @ X2) => ((bigcity @ portland) @ X2))))),introduced(definition,[new_symbols(definition,[sP6])])).
% 1.99/2.20 thf(sP7,plain,sP7 <=> (![X1:mworld]:((((mrel @ '#b_alice') @ mactual) @ X1) => ((bigcity @ portland) @ X1))),introduced(definition,[new_symbols(definition,[sP7])])).
% 1.99/2.20 thf(sP8,plain,sP8 <=> (![X1:mworld]:((((mrel @ '#b_bob') @ eigen__0) @ X1) => ((bigcity @ portland) @ X1))),introduced(definition,[new_symbols(definition,[sP8])])).
% 1.99/2.20 thf(sP9,plain,sP9 <=> ((bigcity @ portland) @ eigen__1),introduced(definition,[new_symbols(definition,[sP9])])).
% 1.99/2.20 thf(sP10,plain,sP10 <=> (![X1:mworld]:((!!) @ ((mrel @ '#b_alice') @ X1))),introduced(definition,[new_symbols(definition,[sP10])])).
% 1.99/2.20 thf(def_mlocal,definition,(mlocal = (^[X1:mworld>$o]:(X1 @ mactual)))).
% 1.99/2.20 thf(def_mnot,definition,(mnot = (^[X1:mworld>$o]:(^[X2:mworld]:(~((X1 @ X2))))))).
% 1.99/2.20 thf(def_mand,definition,(mand = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:(~(((X1 @ X3) => (~((X2 @ X3))))))))))).
% 1.99/2.20 thf(def_mor,definition,(mor = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:((~((X1 @ X3))) => (X2 @ X3))))))).
% 1.99/2.20 thf(def_mimplies,definition,(mimplies = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:((X1 @ X3) => (X2 @ X3))))))).
% 1.99/2.20 thf(def_mequiv,definition,(mequiv = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:((X1 @ X3) = (X2 @ X3))))))).
% 1.99/2.20 thf(def_mbox,definition,(mbox = (^[X1:mindex]:(^[X2:mworld>$o]:(^[X3:mworld]:(![X4:mworld]:((((mrel @ X1) @ X3) @ X4) => (X2 @ X4)))))))).
% 1.99/2.20 thf(def_mdia,definition,(mdia = (^[X1:mindex]:(^[X2:mworld>$o]:(^[X3:mworld]:(~((![X4:mworld]:((((mrel @ X1) @ X3) @ X4) => (~((X2 @ X4)))))))))))).
% 1.99/2.20 thf(con,conjecture,sP6).
% 1.99/2.20 thf(h1,negated_conjecture,(~(sP6)),inference(assume_negation,[status(cth)],[con])).
% 1.99/2.20 thf(1,plain,(~(sP1) | sP2),inference(all_rule,[status(thm)],[])).
% 1.99/2.20 thf(2,plain,(~(sP7) | sP5),inference(all_rule,[status(thm)],[])).
% 1.99/2.20 thf(3,plain,((~(sP5) | ~(sP2)) | sP9),inference(prop_rule,[status(thm)],[])).
% 1.99/2.20 thf(4,plain,(~(sP10) | sP1),inference(all_rule,[status(thm)],[])).
% 1.99/2.20 thf(5,plain,(sP4 | ~(sP9)),inference(prop_rule,[status(thm)],[])).
% 1.99/2.20 thf(6,plain,(sP8 | ~(sP4)),inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__1])).
% 1.99/2.20 thf(7,plain,(sP3 | ~(sP8)),inference(prop_rule,[status(thm)],[])).
% 1.99/2.20 thf(8,plain,(sP6 | ~(sP3)),inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__0])).
% 1.99/2.20 thf(axiom_2,axiom,(mlocal @ ((mbox @ '#b_alice') @ (bigcity @ portland)))).
% 1.99/2.20 thf(9,plain,sP7,inference(preprocess,[status(thm)],[axiom_2]).
% 1.99/2.20 thf('mrel_#b_alice_universal',axiom,sP10).
% 1.99/2.20 thf(10,plain,$false,inference(prop_unsat,[status(thm),assumptions([h1,h0])],[1,2,3,4,5,6,7,8,9,'mrel_#b_alice_universal',h1])).
% 1.99/2.20 thf(11,plain,$false,inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[10,h0])).
% 1.99/2.20 thf(0,theorem,sP6,inference(contra,[status(thm),contra(discharge,[h1])],[10,h1])).
% 1.99/2.20 % SZS output end Proof
%------------------------------------------------------------------------------